A generalisation of Eberlein’s integral over function space
نویسندگان
چکیده
منابع مشابه
Automated Generalisation of Function Definitions
We address the problem of finding the common generalisation of a set of Haskell function definitions so that each function can be defined by partial application of the generalisation. By analogy with unification, which derives the most general common specialisation of two terms, we aim to infer the least general common generalisation. This problem has a unique solution in a first-order setting,...
متن کاملPlane Strain Deformation of a Poroelastic Half-Space Lying Over Another Poroelastic Half-Space
The plane strain deformation of an isotropic, homogeneous, poroelastic medium caused by an inclined line-load is studied using the Biot linearized theory for fluid saturated porous materials. The analytical expressions for the displacements and stresses in the medium are obtained by applying suitable boundary conditions. The solutions are obtained analytically for the limiting case of undrained...
متن کاملA Method of Function Space for Vertical Impedance Function of a Circular Rigid Foundation on a Transversely Isotropic Ground
This paper is concerned with investigation of vertical impedance function of a surface rigid circular foundation resting on a semi-infinite transversely isotropic alluvium. To this end, the equations of motion in cylindrical coordinate system, which because of axissymmetry are two coupled equations, are converted into one partial differential equation using a method of potential function. The g...
متن کاملOptimisation and Generalisation: Footprints in Instance Space
The chief purpose of research in optimisation is to understand how to design (or choose) the most suitable algorithm for a given distribution of problem instances. Ideally, when an algorithm is developed for specific problems, the boundaries of its performance should be clear, and we expect estimates of reasonably good performance within and (at least modestly) outside its ‘seen’ instance distr...
متن کاملAutomated Generalisation of Function De nitions
We address the problem of nding the common generalisa-tion of a set of Haskell function deenitions so that each function can be deened by partial application of the generalisation. By analogy with uniication, which derives the most general common specialisation of two terms, we aim to infer the least general common generalisation. This problem has a unique solution in a rst-order setting, but n...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Transactions of the American Mathematical Society
سال: 1966
ISSN: 0002-9947
DOI: 10.1090/s0002-9947-1966-0193494-5